Interactive Visual Analysis of Networked Systems: Workflows for Two Industrial Domains

We report on a first study of interactive visual analysis of networked systems. Working with ABB Corporate Research and Ericsson Research, we have created workflows which demonstrate the potential of visualization in the domains of industrial automation and telecommunications. By a workflow in this context, we mean a sequence of visualizations and the actions for generating them. Visualizations can be any images that represent properties of the data sets analyzed, and actions typically either change the selection of data visualized or change the visualization by choice of technique or change of parameters

Libra, a Multi-hop Radio Network Bandwidth Market

Libra is a two-level market which assigns fractional shares of time to the transmitting nodes in local regions of a multi-hop network. In Libra, users are assigned budgets by management and users assign funding to services within their budget limits. The purpose is to prioritize users and also optimize network utilization by preventing source nodes from injecting too much traffic into the network and thereby causing downstream packet loss. All transmitting nodes sell capacity in the region surrounding them, and buy capacity from their neighbors in order to be able to transmit. Streams buy capacity from each of the nodes on their paths, thus streams that cross the same region compete directly for the bandwidth in that region. Prices are adjusted incrementally on both levels

Evolution of a supply chain management game for the trading agent competition

TAC SCM is a supply chain management game for the Trading Agent Competition (TAC). The purpose of TAC is to spur high quality research into realistic trading agent problems. We discuss TAC and TAC SCM: game and competition design, scientific impact, and lessons learnt

SICS MarketSpace: an agent-based market infrastructure

We present a simple and uniform communication framework for an agent-based market infrastructure, the goal of which is to enable automation of markets with self-interested participants distributed over the Internet

Personalized Decentralized Communication

Search engines, portals and topic-centered web sites are all attempts to create more or less personalized web-services. However, no single service can in general fulfill all needs of a particular user, so users have to search and maintain personal profiles at several locations. We propose an architecture where each person has his own information management environment where all personalization is made locally. Information is exchanged with other’s if it’s of mutual interest that the information is published or received. We assume that users are self-interested, but that there is some overlap in their interests. Our recent work has focused on decentralized dissemination of information, specifically what we call decentralized recommender systems. We are investigating the behavior of such systems and have also done some preliminary work on the users’ information environment

Finding out = Achieving Decidability

We present a framework for reasoning about the concepts of "knowing what" and "finding out", in which the key concept is to identify "finding out the answer to question Q" with "achieving a situation in which Q is decidable" . We give examples of how the framework can be used to formulate non-trivial problems involving the construction of plans to acquire and use information, and go on to demonstrate that these problems can often be solved by systematic application of a small set of goal-directed backward-chaining rules. In conclusion, it is suggested that systems of this kind are potentially implementable in l-Prolog, a logic programming language based on higher-order logic

Kernel Andorra Prolog and its computation model

The logic programming language framework Kernel Andorra Prolog is defined by a formal computation model. In Kernel Andorra Prolog, general combinations of concurrent reactive languages and nondeterministic transformational languages may be specified. The framework is based on constraints

Programming paradigms of the Andorra Kernel Language

The Andorra Kernel Language (AKL) is introduced. It is shown how AKL provides the programming paradigms of both Prolog and GHC. This is the original goal of the design. However, it has also been possible to provide capabilities beyond that of Prolog and GHC. There are means to structure search, more powerful than plain backtracking. It is possible to encapsulate search in concurrent reactiveprocesses. It is also possible to write a multi-way merger with constant delay.In these respects AKL is quite original. Although AKL is an instance of our previously introduced Kernel Andorra Prolog framework, this exposition contains important extensions, and a considerable amount of unnecessary formal overhead has been stripped away

Epistemic reasoning, logic programming, and the interpretation of questions

Reasons are given to support the claim that strong connections exist between linguistic theories on question semantics and work within AI and logic programming. Various ways of assigning denotations to questions are compared, and it is argued that the earlier, "naive" version is to be preferred to more recent developments. It is shown that it is possible to use the chosen denotation to give a model-theoretic semantics for the concept of "knowing what", from which a relationship between "knowing what" and "knowing" can provably be derived. An application to logic programming is described, which allows formal reasoning about what a logic database "knows", this being in a sense a generalization of the Closed World Assumption. Finally, a "knows-what" meta-interpreter in Prolog is demonstrated, and proved to be sound and complete for a certain class of database programs